Realizability algebras II : new models of ZF + DC

نویسنده

  • Jean-Louis Krivine
چکیده

The technology of classical realizability was developed in [15, 18] in order to extend the proof-program correspondence (also known as Curry-Howard correspondence) from pure intuitionistic logic to the whole of mathematical proofs, with excluded middle, axioms of ZF, dependent choice, existence of a well ordering on P (N), . . . We show here that this technology is also a new method in order to build models of ZF and to obtain relative consistency results. The main tools are : • The notion of realizability algebra [18], which comes from combinatory logic [2] and plays a role similar to a set of forcing conditions. The extension from intuitionistic to classical logic was made possible by Griffin’s discovery [7] of the relation between the law of Peirce and the instruction call-with-current-continuation of the programming language SCHEME. In this paper, we only use the simplest case of realizability algebra, which I call standard realizability algebra ; somewhat like the binary tree in the case of forcing. • The theory ZFε [13] which is a conservative extension of ZF, with a notion of strong membership, denoted as ε. The theory ZFε is essentially ZF without the extensionality axiom. We note an analogy with the Fraenkel-Mostowski models with “urelements” : we obtain a non well orderable set, which is a Boolean algebra denoted ג2, all elements of which (except 1) are empty. But we also notice two important differences : • The final model of ZF + ¬ AC is obtained directly, without taking a suitable submodel. • There exists an injection from the “pathological set” ג2 into R, and therefore R is also not well orderable. We show the consistency, relatively to the consistency of ZF, of the theory ZF + DC (dependent choice) with the following properties : there exists a sequence (Xn)n∈N of infinite subsets of R, the “cardinals” of which are strictly increasing (this means that there is an injection but no surjection from Xn to Xn+1), and such that Xm×Xn is equipotent with Xmn for m,n ≥ 2 ; there exists a sequence of infinite subsets of R, the “cardinals” of which are strictly decreasing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizability algebras III: some examples

The notion of realizability algebra, which was introduced in [17, 18], is a tool to study the proof-program correspondence and to build new models of set theory, which we call realizability models of ZF. It is a variant of the well known notion of combinatory algebra, with a new instruction cc, and a new type for the environments. The sets of forcing conditions, in common use in set theory, are...

متن کامل

Bar recursion in classical realisability : dependent choice and well ordering of R

This paper is about the bar recursion operator [9], in the context of classical realizability [6, 7]. It is a sequel to the three papers [1, 2, 10]. We use the definitions and notations of the theory of classical realizability as expounded in [5, 6, 7].1 In [1], S. Berardi, M. Bezem and T. Coquand have shown that a form of the bar recursion operator can be used, in a proof-program correspondenc...

متن کامل

On the Structure of Classical Realizability Models of ZF

In [6, 7, 9], we have introduced the technique of classical realizability, which permits to extend the Curry-Howard correspondence between proofs and programs [5], to ZermeloFraenkel set theory. The models of ZF we obtain in this way are called realizability models ; this technique is an extension of the method of forcing, in which the ordered sets (sets of conditions) are replaced with more co...

متن کامل

Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis

This paper is about the bar recursion operator in the context of classical realizability. The pioneering work of Berardi, Bezem, Coquand [1] was enhanced by Berger and Oliva [2]. Then Streicher [12] has shown, by means of their bar recursion operator, that the realizability models of ZF, obtained from usual models of λ-calculus (Scott domains, coherent spaces, . . . ), satisfy the axiom of depe...

متن کامل

Sheaf toposes for realizability

We compare realizability models over partial combinatory algebras by embedding them into sheaf toposes. We then use the machinery of Grothendieck toposes and geometric morphisms to study the relationship between realizability models over different partial combinatory algebras. This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2010